Collaborative Decoding Using Turbo Codes
نویسندگان
چکیده
Cooperative reception allows diversity to be achieved by a group of radios that are not physically connected but that receive independent copies of a message. The receivers achieve diversity by exchanging messages. One such technique is collaborative decoding, in which the receivers iterate between decoding and information exchange. Collaborative decoding has been shown to be effective for convolutional codes. In this paper we investigate the performance of collaborative decoding with turbo codes. We also investigate collaborative detection of a partial-time jammer.
منابع مشابه
Efficient Decoding of Turbo Codes with Nonbinary Belief Propagation
This paper presents a new approach to decode turbo codes using a nonbinary belief propagation decoder. The proposed approach can be decomposed into two main steps. First, a nonbinary Tanner graph representation of the turbo code is derived by clustering the binary parity-check matrix of the turbo code. Then, a group belief propagation decoder runs several iterations on the obtained nonbinary Ta...
متن کاملTurbo Codes with Non-Systematic Constituent Codes∗
Turbo codes are usually constructed using systematic recursive convolutional codes (SRCC’s) as constituent codes. In this paper, we introduce a new class of turbo codes that uses nonsystematic recursive convolutional codes (NSRCC’s) as constituent codes. A systematic constituent code then becomes a particular case of this more general class. The use of this larger class of constituent codes enh...
متن کاملStudy of Turbo Codes and Decoding in Binary Erasure Channel Based on Stopping Set Analysis
In this paper, we define a stopping set of turbo codes with the iterative decoding in the binary erasure channel. Based on the stopping set analysis, we study the block and bit erasure probabilities of turbo codes and the performance degradation of the iterative decoding against the maximum-likelihood decoding. The error floor performance of turbo codes with the iterative decoding is dominated ...
متن کاملFull-parallel architecture for turbo decoding of product codes
A full-parallel architecture for turbo decoding, which achieves ultrahigh data rates when using product codes as error correcting codes, is proposed. This architecture is able to decode product codes using binary BCH or m-ary Reed-Solomon component codes. The major advantage of our architecture is that it enables the memory blocks between all half-iterations to be removed. Moreover, the latency...
متن کاملTurbo Lattices: Construction and Error Decoding Performance
In this paper a new class of lattices called turbo lattices is introduced and established. We use the lattice Construction D to produce turbo lattices. This method needs a set of nested linear codes as its underlying structure. We benefit from turbo codes as our basis codes. Therefore, a set of nested turbo codes based on nested interleavers (block interleavers) and nested convolutional codes i...
متن کامل